On ̄h-Jacobsthal and ̄h-Jacobsthal–Lucas sequences, and related quaternions
نویسندگان
چکیده
منابع مشابه
On Jacobsthal Binary Sequences
S. Magliveras and W. Wei∗, Florida Atlantic University Let Σ = {0, 1} be the binary alphabet, and A = {0, 01, 11} the set of three strings 0, 01, 11 over Σ. Let A∗ denote the Kleene closure of A, and Z the set of positive integers. A sequence in A∗ is called a Jacobsthal binary sequence. The number of Jacobsthal binary sequences of length n ∈ Z is the n Jacobsthal number. Let k ∈ Z, 1 ≤ k ≤ n. ...
متن کاملPREPARATION AND CHARACTERIZATION OF [Ni (MAP) ] ; H- MAP = 2- (METHYLAMINO) PYRIDINE H. Aghabozorg* and H. H. Monfared
We have recently synthesized [Ni (MAP) ] complex [H-MAP= 2- (methylamino) pyridine]. 2- (Methy1amino)pyridine reacts with MeLi in THF and generates the lithium salt (Li-MAP). Further reaction of NiCl with two equivalent of this ligand in THF leads to the formation of a dark red solution. Analytical data, molecular weight, and magnetic susceptibility of this complex confirm the formula [N...
متن کاملCOMPUTATION OF JACOBSTHAL ’ S FUNCTION h ( n ) FOR
Let j(n) denote the smallest positive integer m such that every sequence of m consecutive integers contains an integer prime to n. Let Pn be the product of the first n primes and define h(n) = j(Pn). Presently, h(n) is only known for n ≤ 24. In this paper, we describe an algorithm that enabled the calculation of h(n) for n < 50. 0.
متن کاملTernary Modified Collatz Sequences And Jacobsthal Numbers
We show how to apply the Collatz function and the modified Collatz function to the ternary representation of a positive integer, and we present the ternary modified Collatz sequence starting with a multiple of 3N for an arbitrary large integer N . Each ternary string in the sequence is shown to have a repeating string, and the number of occurrences of each digit in each repeating string is iden...
متن کاملResults on Sidon and B h Sequences
Results on Sidon and Bh Sequences Sangjune Lee A set A of non-negative integers is a Sidon set if all the sums a1 + a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. In this dissertation, we deal with results on the number of Sidon sets in [n] = {0, 1, · · · , n − 1} and the maximum size of Sidon sets in sparse random subsets of [n] or N (the set of natural numbers). We also consider a natural gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2019
ISSN: 1844-0835
DOI: 10.2478/auom-2019-0030